Restricted ∆-trees and Reduction Theorems in Multiple-Valued Logics
نویسندگان
چکیده
In this paper we continue the theoretical study of the possible applications of the ∆-tree data structure for multiple-valued logics, specifically, to be applied to signed propositional formulas. The ∆-trees allow a compact representation for signed formulas as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. New and improved versions of reduction theorems for finite-valued propositional logics are introduced, and a satisfiability algorithm is provided which further generalise the TAS method [1, 5].
منابع مشابه
Restricted ∆-trees in Multiple-Valued Logics
This paper generalises the tree-based data structure of ∆tree to be applied to signed propositional formulas. The ∆-trees allow a compact representation for signed formulas as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. The conversions from signed formulas to ∆-trees and vice...
متن کاملHigh Speed Full Swing Current Mode BiCMOS Logical Operators
In this paper the design of a new high-speed current mode BiCMOS logic circuits isproposed. By altering the threshold detector circuit of the conventional current mode logic circuitsand applying the multiple value logic (MVL) approach the number of transistors in basic logicoperators are significantly reduced and hence a reduction of chip area and power dissipation as wellas an increase in spee...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملCoupled coincidence point and common coupled fixed point theorems in complex valued metric spaces
In this paper, we introduce the concept of a w-compatible mappings and utilize the same to discuss the ideas of coupled coincidence point and coupled point of coincidence for nonlinear contractive mappings in the context of complex valued metric spaces besides proving existence theorems which are following by corresponding unique coupled common fixed point theorems for such mappings. Some illus...
متن کامل